The Linear Conditional Probability Matrix Generator
نویسندگان
چکیده
The goal of IT governance is not only to achieve internal efficiency in an IT organization, but also to support IT’s role as a business enabler. The latter is here denoted IT governance performance, and cannot be controlled by IT management directly. Their realm of control includes IT governance maturity, indicated by e.g. different IT activities, documents, metrics and roles. Current IT governance frameworks are suitable for describing IT governance, but lack the ability to predict how changes to the IT governance maturity indicators affect the IT governance performance. This paper presents a Bayesian network for IT governance performance prediction, learned with experience from 35 case studies. The network learns using the proposed Linear Conditional Probability Matrix Generator. The resulting Bayesian network for IT governance performance prediction can be used to support IT governance decision-making.
منابع مشابه
On Psi-conditional asymptotic stability of first order nonlinear matrix Lyapunov system
We provide necessary and sucient conditions for psi-conditional as-ymptotic stability of the solution of a linear matrix Lyapunov system and sucientconditions for psi -conditional asymptotic stability of the solution of a rst ordernon-linear matrix Lyapunov system X0 = A(t)X + XB(t) + F(t;X).
متن کاملOn Conditional Applications of Matrix Variate Normal Distribution
In this paper, by conditioning on the matrix variate normal distribution (MVND) the construction of the matrix t-type family is considered, thus providing a new perspective of this family. Some important statistical characteristics are given. The presented t-type family is an extension to the work of Dickey [8]. A Bayes estimator for the column covariance matrix &Sigma of MVND is derived under ...
متن کاملBit Error Probability and Encoder Structure
The problem of decoding a binary linear code used over a binary symmetric channel so as to minimize bit error probability, rather than codeword error probability, is studied. In general, there are substantial differences with the maximum likelihood case. The optimal decoding rule depends on the crossover probability of the channel, the bit error probability depends on the generator matrix used,...
متن کاملBit-Error Probability for Maximum-Likelihood Decoding of Linear Block Codes and Related Soft-Decision Decoding Methods
In this correspondence, the bit-error probability Pb for maximum-likelihood decoding of binary linear block codes is investigated. The contribution Pb(j) of each information bit j to Pb is considered and an upper bound on Pb(j) is derived. For randomly generated codes, it is shown that the conventional approximation at high SNR Pb (dH=N) Ps, where Ps represents the block error probability, hold...
متن کاملAn exact reduction of the master equation to a strictly stable system with an explicit expression for the stationary distribution
The evolution of a continuous time Markov process with a finite number of states is usually calculated by the Master equation a linear differential equations with a singular generator matrix. We derive a general method for reducing the dimensionality of the Master equation by one by using the probability normalization constraint, thus obtaining a affine differential equation with a (non-singula...
متن کامل